1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
| #include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
const int INF = 0x3f3f3f3f;
const int maxn = 105;
using namespace std;
struct E{
int to, nxt, l;
}e[maxn * maxn << 1];
int head[maxn], tot = 0;
void addedge(int u, int v, int l){
e[++tot].to = v, e[tot].nxt = head[u], e[tot].l = l;
head[u] = tot;
}
priority_queue <pair<int, int> > q;
int dis[maxn]; bool vis[maxn];
int D, K, Q, n, m;
void Dijkstra(){
q.push(make_pair(0, 1));
for (int i = 2; i <= n; i++) dis[i] = INF; dis[1] = 0;
while (!q.empty()){
int cur = q.top().second; q.pop();
if (vis[cur]) continue; vis[cur] = 1;
for (int i = head[cur]; i; i = e[i].nxt){
int v = e[i].to;
if (dis[v] > dis[cur] + e[i].l){
dis[v] = dis[cur] + e[i].l;
q.push(make_pair(-dis[v], v));
}
}
}
}
int f[maxn][maxn];
int dp[maxn];
int main(){
scanf("%d%d%d%d", &D, &n, &K, &m);
for (int u, v, l, i = 1; i <= m; i++){
scanf("%d%d%d", &u, &v, &l);
addedge(u, v, l); addedge(v, u, l);
} scanf("%d", &Q);
for (int p, l, r, i = 1; i <= Q; i++){
scanf("%d%d%d", &p, &l, &r);
for (int j = l; j <= r; j++) f[p][j] = 1;
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= D; j++)
f[i][j] += f[i][j - 1];
memset(dp, 0x3f, sizeof dp); dp[0] = -K;
for (int i = 1; i <= D; i++){
for (int j = 0; j < i; j++){
for (int k = 1; k <= n; k++)
vis[k] = f[k][i] - f[k][j];
Dijkstra();
if (dis[n] == INF) continue;
dp[i] = min(dp[i], dp[j] + K + dis[n] * (i - j));
}
} printf("%d\n", dp[D]);
return 0;
}
|